Solving nonlinear integral equations with non-separable kernel via a high-order iterative process
نویسندگان
چکیده
In this work we focus on location and approximation of a solution nonlinear integral equations Hammerstein-type when the kernel is non-separable through high order iterative process. For purpose, approximate by means separable then, perform complete study about convergence criteria for approximated obtained to our first problem. Different examples have been tested in apply theoretical results.
منابع مشابه
A Three-Point Iterative Method for Solving Nonlinear Equations with High Efficiency Index
In this paper, we proposed a three-point iterative method for finding the simple roots of non- linear equations via mid-point and interpolation approach. The method requires one evaluation of the derivative and three(3) functions evaluation with efficiency index of 81/4 ≈ 1.682. Numerical results reported here, between the proposed method with some other existing methods shows that our method i...
متن کاملA New Iterative Method For Solving Fuzzy Integral Equations
In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are valid.
متن کاملNew iterative methods with seventh-order convergence for solving nonlinear equations
In this paper, seventh-order iterative methods for the solution ofnonlinear equations are presented. The new iterative methods are developed byusing weight function method and using an approximation for the last derivative,which reduces the required number of functional evaluations per step. Severalexamples are given to illustrate the eciency and the performance of the newiterative methods.
متن کاملAN ITERATIVE METHOD WITH SIX-ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS
Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2021
ISSN: ['1873-5649', '0096-3003']
DOI: https://doi.org/10.1016/j.amc.2021.126385